Adaptive memory programming: local search parallel algorithms for phylogenetic tree construction
نویسندگان
چکیده
منابع مشابه
Adaptive memory programming: local search parallel algorithms for phylogenetic tree construction
One of the most important aspect of molecular and computational biology is the reconstruction of evolutionary relationships. The area is well explored after decades of intensive research. Despite this fact there remains a need for good and efficient algorithms that are capable of reconstructing the evolutionary relationship in reasonable time. Since the problem is computationally intractable, e...
متن کاملAlgorithms for efficient phylogenetic tree construction
The gene-duplication problem is to infer a species supertree from a collection of gene trees that are confounded by complex histories of gene duplications. This problem is NP-hard and thus requires efficient and effective heuristics. Existing heuristics perform a stepwise search of the tree space, where each step is guided by an exact solution to an instance of a local search problem. These loc...
متن کاملParallel Local Search Algorithms
In general, neural networks are regarded as models for massively parallel computation. But very often, this parallelism is rather limited, especially when considering symmetric networks. For instance, Hoppeld networks do not really compute in parallel as their updating algorithm always requires sequential execution. We describe a recurrent network corresponding to a symmetric network and introd...
متن کاملStructured Parallel Programming for Monte Carlo Tree Search
In this paper, we present a new algorithm for parallel Monte Carlo tree search (MCTS). It is based on the pipeline pattern and allows flexible management of the control flow of the operations in parallel MCTS. The pipeline pattern provides for the first structured parallel programming approach to MCTS. Moreover, we propose a new lock-free tree data structure for parallel MCTS which removes sync...
متن کاملAlgorithms for Phylogenetic Tree Reconstruction
Scientists often wish to use the information contained in the DNA sequences of a collection of organisms, or taxa, to infer the evolutionary relationships among those taxa. These evolutionary relationships are generally represented by a labeled binary tree, called a phylogenetic tree. The phylogeny reconstruction problem is computationally di cult because the number of possible solutions increa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Operations Research
سال: 2010
ISSN: 0254-5330,1572-9338
DOI: 10.1007/s10479-010-0682-5